Bounded Variables nonlinear Multiple Criteria Optimization using Scatter search
نویسندگان
چکیده
منابع مشابه
Multiple Criteria Scatter Search
This paper reports an evolutionary approach called Scatter Search, that uses the concept of Pareto optimality to obtain a good approximate Pareto frontier. In order to designate a subset of strategies to be a reference solutions a choice function called Kramer Selection is used. A variant of measure of Kemen-Snell may be used, in our case study, in order to find a diverse set to complement the ...
متن کاملAbYSS: Adapting Scatter Search for Multiobjective Optimization
In this paper we propose a new algorithm for solving multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called AbYSS, which follows the scatter search structure but using mutation and crossover operators coming from the field of evolutionar...
متن کاملA black-box scatter search for optimization problems with integer variables
The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these problems as integer optimization problems. We assume that the decision variables are bounded and that there ...
متن کاملScatter search based interactive multi-criteria optimization of fuzzy objectives for coal production planning
We present an interactive multi-criteria procedure that uses user defined tradeoff-cutting planes to identify promising feasible solution search space. New solutions in the promising feasible solution search space are constructed using combination of scatter and random search. The procedure of identifying tradeoff-cutting planes and scatter search continues for either a predetermined fixed numb...
متن کاملIntegrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems
This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for bi-criteria {0,1}-knapsack problems. A hybrid approach which combines systematic and heuristic search is proposed to reduce that inaccuracy in the context of a scatter search method. The components of the method are used to determine regions in the decision space to be systematically searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Matemática: Teoría y Aplicaciones
سال: 2011
ISSN: 1409-2433
DOI: 10.15517/rmta.v11i1.235